Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

With emergencies being, unfortunately, part of our lives, it is crucial to efficiently plan and allocate emergency response facilities that deliver effective and timely relief to people most in need. Emergency Medical Services (EMS) allocation problems deal with locating EMS facilities among potential sites to provide efficient and effective services over a wide area with spatially distributed ...

The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...

We consider definably compact groups in an o-minimal expansion of a real closed field. It is known that to each such group G is associated a natural exact sequence 1→ G00 → G → G/G00 → 1 where G00 is the “infinitesimal subgroup” of G and G/G00 is a compact real Lie group. We show that given a connected open subset U of G/G00 there is a canonical isomorphism between the fundamental group of U an...

Given a vector space V and a non-singular quadratic form Q on V , the orthogonal group O(Q) is the subgroup of GL(V ) that preserves Q. The special orthogonal group SO(Q) is given by O(Q) ∩ SL(V ). If Q is the standard inner product on R then SO(Q) is denoted SO(n). This is a connected, compact Lie group. For n > 2, the group is semi-simple. In the case that n is odd, SO(n) corresponds to the D...

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...